Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое bogo-sort - определение
HIGHLY INEFFECTIVE SORTING ALGORITHM THAT SUCCESSIVELY GENERATES PERMUTATIONS OF ITS INPUT UNTIL IT FINDS ONE THAT IS SORTED
Stupid sort/Bogo-sort; Stupid sort/Bogosort; Bozo sort; Randomsort; Random sort; Bogo-sort; Monkey sort; Randomized Exchange Sort; Bogo sort; Bogosorting; Blort sort; Pogosort; Shotgun sort; Quantum Bogosort; Quantum bogosort; Goro sort; Gorosort; Bogobogosort; Bozosort; Worstsort
Найдено результатов: 108
bogo-sort
<algorithm, humour> /boh"goh-sort"/ (Or "stupid-sort") The
archetypical perversely awful algorithm (as opposed to
bubble sort, which is merely the generic *bad* algorithm).
Bogo-sort is equivalent to repeatedly throwing a deck of cards
in the air, picking them up at random, and then testing
whether they are in order. It serves as a sort of canonical
example of awfulness. Looking at a program and seeing a dumb
algorithm, one might say "Oh, I see, this program uses
bogo-sort."
Also known as "monkey sort" after the {Infinite Monkey
Theorem}.
Compare brute force, Lasherism.
bogo-sortadam/psort">An implementation (http://stdout.org/bogo-sortadam/psort).
[Jargon File ]
(2002-04-07)
monkey sort
Sort (C++)
A FUNCTION FOR SORTING IN C++ STANDARD LIBRARY
Std::sort
sort is a generic function in the C++ Standard Library for doing comparison sorting. The function originated in the Standard Template Library (STL).
Counting sort
SORTING ALGORITHM
Tally sort; Bit sort; Set sort; Ultrasort; Math sort; Count sort
In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small positive integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that possess distinct key values, and applying prefix sum on those counts to determine the positions of each key value in the output sequence.
bubble sort
![An example of bubble sort. Starting from the beginning of the list, compare every adjacent pair, swap their position if they are not in the right order (the latter one is smaller than the former one). After each [[iteration]], one less element (the last one) is needed to be compared until there are no more elements left to be compared.](https://commons.wikimedia.org/wiki/Special:FilePath/Bubble-sort-example-300px.gif?width=200 "An example of bubble sort. Starting from the beginning of the list, compare every adjacent pair, swap their position if they are not in the right order (the latter one is smaller than the former one). After each [[iteration]], one less element (the last one) is needed to be compared until there are no more elements left to be compared.")
SIMPLE SORTING ALGORITHM
Bubble sort/C; Bubblesort; Worst case bubble sort; Bubble sort algorithm; BubbleSort; Sinking sort; Sink sort; Bubble Sort
A sorting technique in which pairs of adjacent values in the
list to be sorted are compared and interchanged if they are
out of order; thus, list entries "bubble upward" in the list
until they bump into one with a lower sort value. Because it
is not very good relative to other methods and is the one
typically stumbled on by naive and untutored programmers,
hackers consider it the canonical example of a naive
algorithm. The canonical example of a really *bad* algorithm
is bogo-sort. A bubble sort might be used out of ignorance,
but any use of bogo-sort could issue only from brain damage or
willful perversity.
[Jargon File ]
Odd–even sort
SORTING ALGORITHM THAT REPEATEDLY COMPARES ALL ODD/EVEN INDEXED PAIRS OF ADJACENT ELEMENTS IN THE LIST, SWAPPING MISORDERED PAIRS
Odd even sort; Brick sort; Odd-even sort
In computing, an odd–even sort or odd–even transposition sort (also known as brick sort or parity sort) is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics.
bogo
WIKIMEDIA DISAMBIGUATION PAGE
BOGO; Bogo (disambiguation)
Buy One, Get One free. Aka half-price
Cases of Mt. Dew are bogo at the store this week.
Cases of Mt. Dew are bogo at the store this week.
cocktail shaker sort
SORTING ALGORITHM
Bidirectional bubble sort; Shuttle sort; Shaker sort; Double bubble sort; Double Bubble sort; Bidirectional bubble sorts; Cocktail shaker sorts; Shaker sorts; Ripple sort; Ripple sorts; Shuttle sorts; Cocktail sorting; Bidirectional bubble sorting; Cocktail shaker sorting; Ripple sorting; Shuttle sorting; Shuffle sort; Cocktail sort
<algorithm> A bi-directional bubble sort. Passes alternate
between ascending through array indexes, pushing the largest
item to the bottom; and descending through array indexes,
pushing the smallest item to the top.
[Performace vs plain bubble? ]
(2001-03-26)
Cocktail shaker sort
SORTING ALGORITHM
Bidirectional bubble sort; Shuttle sort; Shaker sort; Double bubble sort; Double Bubble sort; Bidirectional bubble sorts; Cocktail shaker sorts; Shaker sorts; Ripple sort; Ripple sorts; Shuttle sorts; Cocktail sorting; Bidirectional bubble sorting; Cocktail shaker sorting; Ripple sorting; Shuttle sorting; Shuffle sort; Cocktail sort
Cocktail shaker sort, also known as bidirectional bubble sort, cocktail sort, shaker sort (which can also refer to a variant of selection sort), ripple sort, shuffle sort, or shuttle sort, is an extension of bubble sort. The algorithm extends bubble sort by operating in two directions.
Oscillating merge sort
Oscillating sort
Oscillating merge sort or oscillating sort is a variation of merge sort used with tape drives that can read backwards. Instead of doing a complete distribution as is done in a tape merge, the distribution of the input and the merging of runs are interspersed.
Википедия
Bogosort
In computer science, bogosort (also known as permutation sort, stupid sort, slowsort or bozosort) is a sorting algorithm based on the generate and test paradigm. The function successively generates permutations of its input until it finds one that is sorted. It is not considered useful for sorting, but may be used for educational purposes, to contrast it with more efficient algorithms.
Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input. An analogy for the working of the latter version is to sort a deck of cards by throwing the deck into the air, picking the cards up at random, and repeating the process until the deck is sorted. Its name is a portmanteau of the words bogus and sort.
